Re-implementing and Extending a Hybrid SAT–IP Approach to Maximum Satisfiability

نویسنده

  • Paul Saikko
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LMHS: A SAT-IP Hybrid MaxSAT Solver

We describe LMHS, an open source weighted partial maximum satisfiability (MaxSAT) solver. LMHS is a hybrid SAT-IP MaxSAT solver that implements the implicit hitting set approach to MaxSAT. On top of the main algorithm, LMHS offers integrated preprocessing, solution enumeration, an incremental API, and the use of a choice of SAT and IP solvers. We describe the main features of LMHS, and give emp...

متن کامل

Implicit Hitting Set Algorithms for Reasoning Beyond NP

Lifting a recent proposal by Moreno-Centeno and Karp, we propose a general framework for so-called implicit hitting set algorithms for reasoning beyond NP. The framework is motivated by empirically successful specific instantiations of the approach—based on interactions between a Boolean satisfiability (SAT) solver and an integer programming (IP) solver—in the context of maximum satisfiability ...

متن کامل

A Quantum Inspired Particle Swarm Algorithm for Solving the Maximum Satisfiability Problem

In this paper we investigate the use of quantum particle swarm optimization (QPSO) principles to resolve the satisfiability problem. We describe QPSOSAT, a new iterative approach for solving the well known Maximum Satisfiability problem (MAX-SAT). This latter has been shown to be NP-hard if the number of variables per clause is greater than 3. The basic idea is to harness the optimization capab...

متن کامل

Improvements to Hybrid Incremental SAT Algorithms

Boolean Satisfiability (SAT) solvers have been successfully applied to a wide range of practical applications, including hardware model checking, software model finding, equivalence checking, and planning, among many others. SAT solvers are also the building block of more sophisticated decision procedures, including Satisfiability Modulo Theory (SMT) solvers. The large number of applications of...

متن کامل

Planning as satisfiability with IPC simple preferences and action costs

Planning as Satisfiability (SAT) is currently the best approach for optimally (wrt makespan) solving classical planning problems and the extension of this framework to include preferences is nowadays considered the reference approach to compute “optimal” plans in SAT-based planning. It includes reasoning about soft goals and plans length as introduced in the 2006 and 2008 editions of the Intern...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015